package com.gitee.feizns.explore.data_structure.array.easy;

/**
 * 674. 最长连续递增序列
 * @author feizns
 * @since 2020/3/24
 */
public class FindLengthOfLCIS {

    public static void main(String[] args) {

    }

    public static int findLengthOfLCIS(int[] nums) {
        int max = 1;
        int cur = 1;
        for (int i = 1; i < nums.length; i++) {
            if ( nums[i] > nums[i - 1] )
                cur++;
            else {
                max = Math.max(max, cur);
                cur = 1;
            }
        }
        return max;
    }

}
